Study the Task completion Time of the Benchmarks @1GHz, 2GHz and 3GHz Processors
نویسندگان
چکیده
The AMD Opteron series processor are having 64-bit operating environment. The highperformance computing (HPC) community has helped processor manufacturers to implement a high performance and low cost processor with reduced instruction set (RISC) like. This paper explains the variation of task completion time with respect to different benchmarks in SPEC CPU INT 2006 benchmark suite using AMD Opteron 2000+ and AMD Opteron 8000+ Series performance scores. We have also calculated Memory wait time @1GHz, @2GHz and@3GHz processor frequency. The benchmarks 429.mcf, 445.gobmk, 456.hmmer, 458.sjeng, 464.h264ref and 483.xalancbmk shows less memory wait time @1GHz, @2GHz and@3GHz processor frequency. The other six benchmarks in INT suite shows high memory wait time. Among all benchmarks 483.xalancbmk (XSLT Processor) and 456.hmmer (Search a Gene Sequence Database) shows high performance on AMD Opteron 2000+ and AMD Opteron 8000+ Series.
منابع مشابه
Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملAn Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملGASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment
The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...
متن کامل